Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations
نویسندگان
چکیده
We present a specialised (polynomial-based) rule for the propositional logic called the Independence Rule, which is useful to compute the conservative retractions of propositional logic theories. In this paper we show the soundness and completeness of the logical calculus based on this rule, as well as other applications. The rule is defined by means of a new kind of operator on propositional formulae. It is based on the boolean derivatives on the polynomial ring F2[x].
منابع مشابه
The Characteristics of Writing Environments for Mathematics: Behavioral Consequences and Implications for Software Design and Usability
Software Engineering for Mathematics p. 27 Calculemus Talks Some Traditional Mathematical Knowledge Management p. 28 Math Handwriting Recognition in Windows 7 and Its Benefits p. 29 Assembling the Digital Mathematics Library p. 31 CAMAL 40 Years on Is Small Still Beautiful? p. 32 Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations p. 45
متن کاملDenotational Semantics for Modal Systems S3-S5 Extended by Axioms for Propositional Quantifiers and Identity
There are logics where necessity is defined by means of a given identity connective: φ := φ ≡ ⊤ (⊤ is a tautology). On the other hand, in many standard modal logics the concept of propositional identity (PI) φ ≡ ψ can be defined by strict equivalence (SE) (φ ↔ ψ). All these approaches to modality involve a principle that we call the Collapse Axiom (CA): “There is only one necessary proposition....
متن کاملA Systematics of Deontic Action Logics Based on Boolean Algebra
Within the scope of interest of deontic logic, systems in which names of actions are arguments of deontic operators (deontic action logic) have attracted less interest than purely propositional systems. However, in our opinion, they are even more interesting from both theoretical and practical point of view. The fundament for contemporary research was established by K. Segerberg, who introduced...
متن کاملA Undecidability of propositional separation logic and its neighbours
In this paper, we investigate the logical structure of memory models of theoretical and practical interest. Separation logic provides us with an effective language for reasoning about such memory models. Our main result is that for any concrete choice of heap-like memory model, validity in that model is undecidable even for purely propositional formulas in this language. The main novelty of our...
متن کاملClasses of Fuzzy Filters of Residuated Lattice Ordered Monoids
The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. Bounded residuated lattice ordered monoids (Rl-monoids) are common generalizations of BL-algebras, i.e., algebras of the propositional basic fuzzy logic, and Heyting algebras, i.e., algebras of the propositional intuitionistic logic. From the point of view of uncertain i...
متن کامل